Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms
نویسندگان
چکیده
منابع مشابه
Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملSolving the Vehicle Routing Problem with Time Windows by Bee Colony Optimization Metaheuristic
The vehicle routing problem with time windows is studied in the paper. This problem has been solved by Bee Colony Optimization metaheuristic. Proposed algorithm has been tested on the set of well-known benchmark examples. Obtained results show that the presented algorithm can find high-quality solutions.
متن کاملProbabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
In the Vehicle Routing Problem with Time Windows, a set of customers are served by a eet of vehicles of limited capacity, initially located at a central depot. Each customer provides a period of time in which they require service, which may consist of repair work or loading/unloading the vehicle. The objective is to nd tours for the vehicles, such that each customer is served in its time window...
متن کاملVehicle Routing Problem with Time Windows
The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PROMET - Traffic&Transportation
سال: 1970
ISSN: 1848-4069,0353-5320
DOI: 10.7307/ptt.v24i4.443